class Solution: def hongstriangle(self , nums: List[int]) -> int: # write code here len1=len(nums) nums=sorted(nums) res=0 i0,j0,k0=len1,len1,len1 for i in range(len1): for j in range(i+1,len1): for k in range(j+1,len1): if nums[i]+nums[j]>nums[k] : if res>nums[i]+nums[j]+nums[k] or res==0: res=nums[i]+nums[j]+nums[k] i0,j0,k0=nums[i],nums[j],nums[j] else: break if nums[i]>=j0 and nums[j]>=k0:break if nums[i]>=k0:break return res